ZNN models for computing matrix inverse based on hyperpower iterative methods
نویسندگان
چکیده
منابع مشابه
On the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملSoftware for computing eigenvalue bounds for iterative subspace matrix methods
A procedure is presented for the computation of bounds to eigenvalues of the generalized hermitian eigenvalue problem and to the standard hermitian eigenvalue problem. This procedure is applicable to iterative subspace eigenvalue methods and to both outer and inner eigenvalues. The Ritz values and their corresponding residual norms, all of which are computable quantities, are needed by the proc...
متن کاملOn computing generalized inverse systems using matrix pencil methods
We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state space representation. We put a particular emphasis on two classes of inverses: the week generalized inverse and the MoorePenrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computa...
متن کاملon the modified iterative methods for $m$-matrix linear systems
this paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the accelerated overrelaxation (aor) method. in this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملInterval Iterative Methods for Computing
In this paper, we import interval method to the iteration for computing Moore-Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton iteration by interval method, we can get better numerical results. The convergence of the interval iteration is proven. We also give some numerical examples to compare interval iteration with classical Newton iteration.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2017
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1710999s